Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
نویسندگان
چکیده
We study graphs G = (V,E) containing a long cycle which for given integers a1, a2, ..., ak ∈ N have an edge cut whose removal results in k components with vertex sets V1, V2, ..., Vk such that |Vi| ≥ ai for 1 ≤ i ≤ k. Our results closely relate to problems and recent research in network sharing and network reliability.
منابع مشابه
Incidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملCyclic 7-edge-cuts in fullerene graphs
A fullerene graph is a planar cubic graph whose all faces are pentagonal and hexagonal. The structure of cyclic edge-cuts of fullerene graphs of sizes up to 6 is known. In the paper we study cyclic 7-edge connectivity of fullerene graphs, distinguishing between degenerated and non-degenerated cyclic edge-cuts, regarding the arrangement of the 12 pentagons. We prove that if there exists a non-de...
متن کامل4-restricted Edge Cuts of Graphs
A 4-restricted edge cut is an edge cut of a connected graph which disconnects the graph, where each component has order at least 4. Graphs that contain 4-restricted edge cuts are characterized in this paper. As a result, it is proved that a connected graph G of order at least 10 contains 4-restricted edge cuts if and only if it contains no cut-vertex u where every component of G \ u has order a...
متن کاملEdge-cuts in Graphs
In an earlier paper [3], we studied cycles in graphs that intersect all edge-cuts of prescribed sizes. Passing to a more general setting, we examine the existence of T -joins in grafts that intersect all edge-cuts whose size is in a given set A ⊆ {1, 2, 3}. In particular, we characterize all the contractionminimal grafts admitting no T -joins that intersect all edge-cuts of size 1 and 2. We als...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 52 شماره
صفحات -
تاریخ انتشار 2008